(Q, S)-distance model and counting algorithms in dynamic distributed systems
نویسندگان
چکیده
منابع مشابه
coordination of protective schemes in distribution and subtransmission systems including distributed generation
نصب منابع پراکنده در سیستم های توزیع و فوق توزیع علاوه بر مزیت های فراوان، مشکلاتی را هم به همراه دارد. یکی از این مشکلات تأثیر این منابع روی اندازه جریان های اتصال کوتاه است. به طور معمول از حفاظت های مبتنی بر اصل جریان زیاد در سیستم های توزیع و فوق توزیع استفاده می شود. از مهمترین طرح های حفاظتی استفاده شده در فیدرهای توزیع، حفاظت فیوز- ریکلوزر است. همچنین از طرح های حفاظتی جریان زیاد جهتی در...
Dynamic Migration Algorithms for Distributed Object Systems
Complex distributed object systems require dynamic migration algorithms thnt allocate and reallocate objects to respond to changes in the load or in the availabilip of the resources. I n this paper we present the Cooling and HotSpot migration algorithms that reallocate objects when the load on a processor is high or when the latency of a task is high. The algorithms have been iniplenietited as ...
متن کاملa Simplified Model of Distributed Parameter Systems
A generalized simplified model for describing the dynamic behavior of distributed parameter systems is proposed. The various specific characteristics of gain and phase angle of distributed parameter systems are investigated from frequency response formulation and complex plane representation of the proposed simplified model. The complex plane investigation renders some important inequality cons...
متن کاملDynamic Distributed Genetic Algorithms
Distributed populations in Genetic Algorithms can make the search more smart, in that local minima may be skipped. However, when the global population is divided into small sub-populations, the ability of these sub-populations to evolve is set back because of their relatively small sizes. In this paper, a new method to manage the distributed populations in evolution is introduced. A supervising...
متن کاملAlgorithms for Propositional Model Counting
We present algorithms for the propositional model counting problem #SAT. The algorithms utilize tree decompositions of certain graphs associated with the given CNF formula; in particular we consider primal, dual, and incidence graphs. We describe the algorithms coherently for a direct comparison and with sufficient detail for making an actual implementation reasonably easy. We discuss several a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2018
ISSN: 1550-1477,1550-1477
DOI: 10.1177/1550147718756872